Max-Cut Parameterized Above the Edwards-Erd\H{o}s Bound
نویسندگان
چکیده
We study the boundary of tractability for the Max-Cut problem in graphs. Our main result shows that Max-Cut above the EdwardsErdős bound is fixed-parameter tractable: we give an algorithm that for any connected graph with n vertices and m edges finds a cut of size
منابع مشابه
Beyond Max-Cut: λ-Extendible Properties Parameterized Above the Poljak-Turzík Bound
Poljak and Turzík (Discrete Math. 1986) introduced the notion of λ-extendible properties of graphs as a generalization of the property of being bipartite. They showed that for any 0 < λ < 1 and λ-extendible property Π, any connected graph G on n vertices and m edges contains a spanning subgraph H ∈ Π with at least λm+ 1−λ 2 (n−1) edges. The property of being bipartite is λ-extendible for λ = 1/...
متن کاملBeyond Max-Cut: lambda-Extendible Properties Parameterized Above the Poljak-Turzik Bound
Poljak and Turzík (Discrete Math. 1986) introduced the notion of λ-extendible properties of graphs as a generalization of the property of being bipartite. They showed that for any 0 < λ < 1 and λ-extendible property Π, any connected graph G on n vertices and m edges contains a spanning subgraph H ∈ Π with at least λm+ 1−λ 2 (n−1) edges. The property of being bipartite is λ-extendible for λ = 1/...
متن کاملImproved kernels for Signed Max Cut parameterized above lower bound on (r, l)-graphs
A graph G is signed if each edge is assigned + or −. A signed graph is balanced if there is a bipartition of its vertex set such that an edge has sign − if and only if its endpoints are in different parts. The Edwards-Erdös bound states that every graph with n vertices and m edges has a balanced subgraph with at least m 2 +n−1 4 edges. In the Signed Max Cut Above Tight Lower Bound (Signed Max C...
متن کاملImproved Kernels for Signed Max Cut Parameterized Above Lower Bound on (r, `)-graphs
A graph G is signed if each edge is assigned + or −. A signed graph is balanced if there is a bipartition of its vertex set such that an edge has sign − if and only if its endpoints are in different parts. The Edwards-Erdös bound states that every graph with n vertices and m edges has a balanced subgraph with at least m 2 +n−1 4 edges. In the Signed Max Cut Above Tight Lower Bound (Signed Max C...
متن کاملAbove and below Guarantee Parameterizations for Combinatorial Optimisation Problems
Parameterized complexity can be viewed as a two-dimensional approach to traditional complexity theory. Rather than measuring the complexity of a problem purely in terms of the input size, we also consider some structural parameter of the input instance, and measure how the complexity of the problem changes as this parameter changes. The analogue of polynomial time tractability is fixed-paramete...
متن کامل